Link-Based Similarity Measures Using Reachability Vectors
نویسندگان
چکیده
منابع مشابه
Link-Based Similarity Measures Using Reachability Vectors
We present a novel approach for computing link-based similarities among objects accurately by utilizing the link information pertaining to the objects involved. We discuss the problems with previous link-based similarity measures and propose a novel approach for computing link based similarities that does not suffer from these problems. In the proposed approach each target object is represented...
متن کاملLink Prediction using Network Embedding based on Global Similarity
Background: The link prediction issue is one of the most widely used problems in complex network analysis. Link prediction requires knowing the background of previous link connections and combining them with available information. The link prediction local approaches with node structure objectives are fast in case of speed but are not accurate enough. On the other hand, the global link predicti...
متن کاملSimilarity Measures for Link Prediction Using Power Law Degree Distribution
Link Prediction deals with predicting important non-existent edges in a social network that are likely to occur in the near future. Typically a link between two nodes is predicted if the two nodes have high similarity. Well-known local similarity functions make use of information from all the local neighbors. These functions use the same form irrespective of the degree of the common neighbors. ...
متن کاملSimilarity Measure Using Link Based Approach
Web search engines provide an efficient interface to vast information. This web search engine provides the most semantic relativity between the given words, and it will generate the semantic measures automatically, since data on the web is noisy, huge and dynamic. we propose and analyzed and visualized similarity relationships in Web data sets to identify how to integrate content and link analy...
متن کاملHierarchical Routing Using Link Vectors
An area-based link-vector algorithm (ALVA) is introduced for the distributed maintenance of routing information in very large internetworks. According to ALVA, destinations in an internetwork are aggregated in areas in multiple levels of hierarchy. Routers maintain a database that contains a subset of the topology at each level of the hierarchy. This subset corresponds to those links used in pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Scientific World Journal
سال: 2014
ISSN: 2356-6140,1537-744X
DOI: 10.1155/2014/741608